منابع مشابه
Constructing a Theory of ‘IS Business Value’ from the Literature
The purpose of this paper is to draw attention to an innovative use of literature in social science research where the literature may not only be seen as a secondary source of data (Strauss & Corbin 1990) but may also serve as the basis for theory building (Lewis & Grimes 1999; Saunders et. al. 1999). This will be exemplified by attempting to construct a theory of ‘IS business value’ from the l...
متن کاملConstructing an associative concept space for literature-based discovery
Scientific literature is often fragmented, which implies that certain scientific questions can only be answered by combining information from various articles. In this paper, a new algorithm is proposed for finding associations between related concepts present in literature. To this end, concepts are mapped to a multi-dimensional space by a Hebbian type of learning algorithm using co-occurrence...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing cryptographic definitions
This paper mirrors an invited talk to ISCISC 2011. It is not a conventional paper so much as an essay summarizing thoughts on a little-talked-about subject. My goal is to intermix some introspection about definitions with examples of them, these examples drawn mostly from cryptography. Underpinning our discussion are two themes. The first is that definitions are constructed. They are i...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of the New York Academy of Sciences
سال: 1995
ISSN: 0077-8923
DOI: 10.1111/j.1749-6632.1996.tb23162.x